Checkpointing with mutable checkpoints
نویسندگان
چکیده
منابع مشابه
Checkpointing with mutable checkpoints
There are two approaches to reduce the overhead associated with coordinated checkpointing: )rst is to minimize the number of synchronization messages and the number of checkpoints; the other is to make the checkpointing process non-blocking. In our previous work (IEEE Parallel Distributed Systems 9 (12) (1998) 1213), we proved that there does not exist a non-blocking algorithm which forces only...
متن کاملLow - Cost Checkpointing with Mutable Checkpoints in MobileComputing
Mobile computing raises many new issues, such as lack of stable storage, low bandwidth of wireless channel, high mobility, and limited battery life. These new issues make traditional checkpointing algorithms unsuitable. In this paper, we introduce the concept of \muta-ble checkpoint", which is neither a tentative checkpoint nor a permanent checkpoint. Mutable checkpoints can be saved any where;...
متن کاملAnalyzing Mutable Checkpointing via Invariants
The well-known coordinated snapshot algorithm of mutable checkpointing [7–9] is studied. We equip it with a concise formal model and analyze its operational behavior via an invariant characterizing the snapshot computation. By this we obtain a clear understanding of the intermediate behavior and a correctness proof of the final snapshot based on a strong notion of consistency (reachability with...
متن کاملA VP-Accordant Checkpointing Protocol Preventing Useless Checkpoints
A useless checkpoint corresponds to the occurrence of a checkpoint and communication pattern called Z-cycle. A recent result shows that ensuring a computation without Z-cycles is a particular application of a property, namely Virtual Precedence (VP), defined on an interval-based abstraction of a computation. In this paper we first propose a taxonomy of communication-induced checkpointing protoc...
متن کاملReal Time Snapshot Collection Algorithm for Mobile Distributed Systems with Minimum Number of Checkpoints
Checkpointing is an efficient way of implementing fault tolerance in distributed systems. Mobile computing raises many new issues, such as high mobility, lack of stable storage on mobile hosts (MHs), low bandwidth of wireless channels, limited battery life and disconnections that make the traditional checkpointing protocols unsuitable for such systems. Minimum process non-blocking coordinated c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00566-2